A deterministic subclass of context-free languages

Teachability of a Subclass of Simple Deterministic Languages

We show a subclass of simple deterministic languages which is teachable in polynomial examples. Teachability on grammatical inference is studied with the setting called “identification in the limit from polynomial time and data”, and there are negative results for famous languages. In this paper, we show a learning algorithm from membership queries and counterexamples for a subclass of simple d...

Contribution to deterministic top-down analysis of context-free languages

In the present paper a generalization of ZX(A:)-grammars is given, the notion of the switching function for such grammars is introduced and the model of the Parsing Machine using the switch­ ing function is given. We introduce the necessary notions and notation, mainly according to D. E. Knuth: An alphabet X is a finite nonempty set of symbols, and X* denotes the set of all strings on the alpha...

Tape Bounds for Some Subclasses of Deterministic Context-Free Languages

There are several interesting observations to be made concerning the tape complexity of context-free languages. An early result given by Lewis et al. (1965) is that every context-free language can be recognized by an off-line deterministic Turing machine of O((log n) 2) tape complexity. This is still the best result known. Sudborough (1975) shows that if all linear context-free languages can be...

Context - Free Languages and

Context-Free Languages, Coalgebraically

We give a coalgebraic account of context-free languages using the functor D(X) = 2 × X for deterministic automata over an alphabet A, in three different but equivalent ways: (i) by viewing context-free grammars as D-coalgebras; (ii) by defining a format for behavioural differential equations (w.r.t. D) for which the unique solutions are precisely the context-free languages; and (iii) as theD-co...